- asymptotic restriction
- мат.асимптотическое ограничение
English-Russian scientific dictionary. 2008.
asymptotic restriction
Смотреть что такое "asymptotic restriction" в других словарях:
BRST quantization — In theoretical physics, BRST quantization (where the BRST refers to Becchi, Rouet, Stora and Tyutin) is a relatively rigorous mathematical approach to quantizing a field theory with a gauge symmetry. Quantization rules in earlier QFT frameworks… … Wikipedia
Ordinary least squares — This article is about the statistical properties of unweighted linear regression analysis. For more general regression analysis, see regression analysis. For linear regression on a single variable, see simple linear regression. For the… … Wikipedia
Systolic geometry — In mathematics, systolic geometry is the study of systolic invariants of manifolds and polyhedra, as initially conceived by Charles Loewner, and developed by Mikhail Gromov and others, in its arithmetic, ergodic, and topological manifestations.… … Wikipedia
Normally hyperbolic invariant manifold — A normally hyperbolic invariant manifold (NHIM) is a natural generalization of a hyperbolic fixed point and a hyperbolic set. The difference can be described heuristically as follows: For a manifold Λ to be normally hyperbolic we are allowed to… … Wikipedia
Confidence distribution — This article is about the confidence distribution. For Confidence interval, see Confidence interval. In statistics, the concept of a confidence distribution (CD) has often been loosely referred to as a distribution function on the parameter space … Wikipedia
Technicolor (physics) — Beyond the Standard Model Standard Model … Wikipedia
Gauge theory — For a generally accessible and less technical introduction to the topic, see Introduction to gauge theory. In physics, a gauge theory is a type of field theory in which the Lagrangian is invariant under a continuous group of local transformations … Wikipedia
Cooley-Tukey FFT algorithm — The Cooley Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N 1 N 2 in terms of smaller… … Wikipedia
Polylogarithm — Not to be confused with polylogarithmic. In mathematics, the polylogarithm (also known as Jonquière s function) is a special function Lis(z) that is defined by the infinite sum, or power series: It is in general not an elementary function, unlike … Wikipedia
Toshiyuki Kobayashi — (born 1962) is a Japanese mathematicianknown for his original work in the field of Lie theory, and in particular for thetheory of discontinuous groups(lattice in Lie groups)and the application of geometric analysis to representation theory . He… … Wikipedia
Cooley–Tukey FFT algorithm — The Cooley–Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N1N2 in terms of smaller DFTs… … Wikipedia
